package leetcode.problems;

import org.junit.Test;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * Created by gmwang on 2018/7/25
 * 组合求和
 */
public class _0904MinimumAbsoluteDifference {
    /**
     * Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements.
     * 给定一个由不同的  整数组成的数组arr，找到具有任意两个元素的最小绝对差的所有元素对。
     * Return a list of pairs in asce   nding order(with respect to pairs), each pair [a, b] follows
     * 以升序（相对于对）返回对列表，每对[a, b]跟随
     * a, b are from arr
     * a < b
     * b - a equals to the minimum absolute difference of any two elements in arr
     *
     *
     * Example 1:
     *
     * Input: arr = [4,2,1,3]
     * Output: [[1,2],[2,3],[3,4]]
     * Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.
     * Example 2:
     *
     * Input: arr = [1,3,6,10,15]
     * Output: [[1,3]]
     * Example 3:
     *
     * Input: arr = [3,8,-10,23,19,-4,-14,27]
     * Output: [[-14,-10],[19,23],[23,27]]
     *
     *
     * Constraints:
     *
     * 2 <= arr.length <= 10^5
     * -10^6 <= arr[i] <= 10^6
     * /**
     *
     * @param arr
     * @return
     */
    public static List<List<Integer>> minimumAbsDifference(int[] arr) {
        List<List<Integer>> list1 = new ArrayList<>();
        List<Integer> list2 = new ArrayList<>();
        list1.add(list2);
        return list1;
    }

    public static void main(String[] args) {
        int [] arr = {4,2,1,3};
        List res = minimumAbsDifference(arr);
        System.out.println(res);
    }

}
